#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;
#define int long long

void solve()
{
    int n , x; cin >> n >> x;
    vector<int>a(n + 1);
    for(int i = 1;i <= n;i ++) cin >> a[i];

    sort(a.begin() + 1 , a.end());
    int res = 0;
    int mp = 0x3f3f3f3f;
    int sum = 0;
    for(int i = n;i >= 1;i --)
    {
        mp = min(a[i] , mp);
        sum ++;
        if(sum * mp >= x)
        {
            res ++;
            mp = 0x3f3f3f3f;
            sum = 0;
        }
    }
    cout << res << endl;
    
}
signed main()
{
    int t; cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}